The suffix Tree of a Tree and Minimizing Sequential Transducers

نویسنده

  • Dany Breslauer
چکیده

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing the Suffix Tree of a Tree with a Large Alphabet

The problem of constructing the suffix tree of a tree is a generalization of the problem of constructing the suffix tree of a string. It has many applications, such as in minimizing the size of sequential transducers and in tree pattern matching. The best-known algorithm for this problem is Breslauer’s O(n log |Σ|) time algorithm where n is the size of the CS-tree and |Σ| is the alphabet size, ...

متن کامل

Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth

Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...

متن کامل

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

We present a simple linear work and space, and polylogarithmic time parallel algorithm for generating multiway Cartesian trees. As a special case, the algorithm can be used to generate suffix trees from suffix arrays on arbitrary alphabets in the same bounds. In conjunction with parallel suffix array algorithms, such as the skew algorithm, this gives a rather simple linear work parallel algorit...

متن کامل

Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining

Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences. This paper proposes an efficient approach for using the preorder linked WAP-trees...

متن کامل

Parallel Query in the Suffix Tree

Given the query string of length m, we explore a parallel query in a static suffix tree based data structure for p n, where p is the number of processors and n is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires O(m+ p) work, O(m/p+ lg p) time and O(n) space in the worst case. We extend the same technique to the suffix tree where we s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 191  شماره 

صفحات  -

تاریخ انتشار 1996